Optimal Design of Two-Qubit Quantum Circuits
نویسنده
چکیده
Current quantum computing hardware is unable to sustain quantum coherent operations for more than a handful of gate operations. Consequently, if near-term experimental milestones, such as synthesizing arbitrary entangled states, or performing fault-tolerant operations, are to be met, it will be necessary to minimize the number of elementary quantum gates used. In order to demonstrate non-trivial quantum computations experimentally, such as the synthesis of arbitrary entangled states, it will be useful to understand how to decompose a desired quantum computation into the shortest possible sequence of one-qubit and two-qubit gates. We contribute to this effort by providing a method to construct an oprimal quantum circuit for a general two-qubit gate that requires at most 3 CNOT gates and 15 elementary onequbit gates. Moreover, if the desired two-qubit gate corresponds to a purely real unitary transformation, we provide a construction that requires at most 2 CNOTs and 12 onequbit gates. We then prove that these constructions are optimal with respect to the family of CNOT, y-rotation, z-rotation, and phase gates.
منابع مشابه
Optimal two-qubit quantum circuits using exchange interactions
We give the optimal decomposition of a universal two-qubit circuit using Heisenberg exchange interactions and single qubit rotations. Tuning the strength and duration of the Heisenberg exchange allows one to implement SWAP gates. Our optimal circuit is constructed from only three SWAP gates and six single qubit gates. We show that three SWAP gates are not only sufficient, but necessary. Since s...
متن کاملA Resource-Optimal Canonical Form for Single-qubit Quantum Circuits
Determining the optimal implementation of a quantum gate is critical for designing a quantum computer. We consider the crucial task of efficiently decomposing a general single-qubit quantum gate into a sequence of fault-tolerant quantum operations. For a given single-qubit circuit, we construct an optimal gate sequence consisting of fault-tolerant Hadamard (H) and π/8 rotations (T ). Our scheme...
متن کاملFault-tolerant adder design in quantum-dot cellular automata
Quantum-dot cellular automata (QCA) are an emerging technology and a possible alternative for faster speed, smaller size, and low power consumption than semiconductor transistor based technologies. Previously, adder designs based on conventional designs were examined for implementation with QCA technology. This paper utilizes the QCA characteristics to design a fault-tolerant adder that is more...
متن کاملArbitrary two-qubit computation in 23 elementary gates
We address the problem of constructing quantum circuits to implement an arbitrary two-qubit quantum computation. We pursue circuits without ancilla qubits and as small a number of elementary quantum gates as possible. Our lower bound for worst-case optimal two-qubit circuits calls for at least 17 gates: 15 one-qubit rotations and 2 controlled-NOT ~CNOT! gates. We also constructively prove a wor...
متن کاملFault-tolerant adder design in quantum-dot cellular automata
Quantum-dot cellular automata (QCA) are an emerging technology and a possible alternative for faster speed, smaller size, and low power consumption than semiconductor transistor based technologies. Previously, adder designs based on conventional designs were examined for implementation with QCA technology. This paper utilizes the QCA characteristics to design a fault-tolerant adder that is more...
متن کامل